Polynomial decomposition

Results: 68



#Item
21A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V (G

A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V (G

Add to Reading List

Source URL: www.pkoms.com

Language: English - Date: 2011-12-29 23:15:14
22BRICS Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers Some Complexity Problems on

BRICS Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers Some Complexity Problems on

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2001-05-28 05:33:34
23An  Improved  Algorithm  for     Computing  Roadmaps  of  Algebraic  Sets   Saugata  Basu   Purdue  University    

An  Improved  Algorithm  for     Computing  Roadmaps  of  Algebraic  Sets   Saugata  Basu   Purdue  University    

Add to Reading List

Source URL: iros2011.org

Language: English - Date: 2011-09-21 06:59:57
24COMBINATORICS OF BINOMIAL PRIMARY DECOMPOSITION ALICIA DICKENSTEIN, LAURA FELICIA MATUSEVICH, AND EZRA MILLER A BSTRACT. An explicit lattice point realization is provided for the primary components of an arbitrary binomi

COMBINATORICS OF BINOMIAL PRIMARY DECOMPOSITION ALICIA DICKENSTEIN, LAURA FELICIA MATUSEVICH, AND EZRA MILLER A BSTRACT. An explicit lattice point realization is provided for the primary components of an arbitrary binomi

Add to Reading List

Source URL: www.math.duke.edu

Language: English - Date: 2008-05-25 20:03:48
25An  Improved  Algorithm  for     Computing  Roadmaps  of  Algebraic  Sets   Saugata  Basu   Purdue  University    

An  Improved  Algorithm  for     Computing  Roadmaps  of  Algebraic  Sets   Saugata  Basu   Purdue  University    

Add to Reading List

Source URL: www.cse.unr.edu

Language: English - Date: 2012-12-20 19:29:22
26Some Basic Matrix Theorems Richard E. Quandt Princeton University Definition 1. Let A be a square matrix of order n and let λ be a scalar quantity. Then det(A−λI) is called the characteristic polynomial of A.

Some Basic Matrix Theorems Richard E. Quandt Princeton University Definition 1. Let A be a square matrix of order n and let λ be a scalar quantity. Then det(A−λI) is called the characteristic polynomial of A.

Add to Reading List

Source URL: www.quandt.com

Language: English - Date: 2009-11-04 11:37:58
27Decomposition of Additive Cellular Automata

Decomposition of Additive Cellular Automata

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-09-20 14:36:39
28Generalized Polynomial Chaos Decomposition for the Stokes Equations with stochastic inputs

Generalized Polynomial Chaos Decomposition for the Stokes Equations with stochastic inputs

Add to Reading List

Source URL: www.mssanz.org.au

Language: English - Date: 2013-01-16 21:25:32
29Computation of a Class of Continued Fraction Constants Lo¨ıck Lhote∗ Abstract We describe a class of algorithms which compute in polynomial– time important constants related to the Euclidean Dynamical System. Our a

Computation of a Class of Continued Fraction Constants Lo¨ıck Lhote∗ Abstract We describe a class of algorithms which compute in polynomial– time important constants related to the Euclidean Dynamical System. Our a

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2005-07-06 08:18:47
30Pebbles in Motion Polynomial Algorithms for Multi-Agent Path Planning Problems Supervisor: Author:

Pebbles in Motion Polynomial Algorithms for Multi-Agent Path Planning Problems Supervisor: Author:

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-01-07 17:29:29